ISRO CSE 2020


Q51.

What is the complexity of the following code? sum=0; for(i=1;i<=n;i*=2) for(j=1;j<=n;j++) sum++;Which of the following is not a valid string?
GateOverflow

Q52.

How many total bits are required for a direct-mapped cache with 128 KB of data and 1 word block size, assuming a 32-bit address and 1 word size of 4 bytes?
GateOverflow

Q53.

Which of the following is an efficient method of cache updating?
GateOverflow

Q54.

The post-order traversal of binary tree is ACEDBHIGF. The pre-order traversal is
GateOverflow

Q55.

The language which is generated by the grammar S \rightarrow a S a\mid b S b\mid a\mid b over the alphabet of {a,b} is the set of
GateOverflow

Q56.

Context free languages are closed under
GateOverflow

Q57.

Three CPU-bound tasks, with execution times of 15, 12 and 5 time units respectively arrive at times 0, t and 8, respectively. If the operating system implements a shortest remaining time first scheduling algorithm, what should be the value of t to have 4 context switches? Ignore the context switches at time 0 and at the end.
GateOverflow

Q58.

Which of the following algorithms defines time quantum?
GateOverflow

Q59.

An aid to determine the deadlock occurrence is
GateOverflow

Q60.

Raymonds tree based algorithm ensures
GateOverflow